ExamPlay Light Logo
Entrar

Computer Science for IGCSE & O level - Algorithm Design And Problem Solving (Section 5 - No. 9)

What is a key characteristic of a 'linear search' algorithm?
It is the fastest search method.
It only works on sorted data.
It examines items in a sequential order.
It uses a divide and conquer approach.

Explicação

Linear search checks each item sequentially until the target is found or the list is exhausted.

Comentários (0)

Faça login para comentar
Anúncio
BrainBehindX Inc Logo
©2026; Distribuído por BrainBehindX Inc